Test-words for Sturmian morphisms
نویسندگان
چکیده
منابع مشابه
Quasiperiodic Sturmian words and morphisms
We characterize all quasiperiodic Sturmian words: a Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity.
متن کاملWords and morphisms with Sturmian erasures
We say x ∈ {0, 1, 2}N is a word with Sturmian erasures if for any a ∈ {0, 1, 2} the word obtained erasing all a in x is a Sturmian word. A large family of such words is given coding trajectories of balls in the game of billiards in the cube. We prove that the monoid of morphisms mapping all words with Sturmian erasures to words with Sturmian erasures is not finitely generated.
متن کاملOn an involution of Christoffel words and Sturmian morphisms
There is a natural involution on Christoffel words, originally studied by the second author in [dL2]. We show that it has several equivalent definitions: one of them uses the slope of the word, and changes the numerator and the denominator respectively in their inverses modulo the length; another one uses the cyclic graph allowing the construction of the word, by interpreting it in two ways (on...
متن کاملPermutation complexity of images of Sturmian words by marked morphisms
We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is n+ k for some constant k and all lengths n sufficiently large.
متن کاملConjugacy of morphisms and Lyndon decomposition of standard Sturmian words
Words 2005-Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words – p.1/11
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Belgian Mathematical Society - Simon Stevin
سال: 1999
ISSN: 1370-1444
DOI: 10.36045/bbms/1103055576